Ordinal operations on graph representations of sets
نویسنده
چکیده
Editorial Board Marat Arslanov, Kazan John T. Baldwin, Chicago, IL Douglas S. Bridges, Canterbury Armin Hemmerling, Greifswald Ramon Jansana, Barcelona Carl G. Jockusch, Urbana, IL Alexander Kechris, Pasadena, CA Ulrich Kohlenbach, Darmstadt H. Dugald Macpherson, Leeds Johann Makowsky, Haifa Andrzej Rosłanowski, Omaha, NE Jörg Rothe, Düsseldorf Wilfried Sieg, Pittsburgh, PA Stephen G. Simpson, State College, PA W. Hugh Woodin, Berkeley, CA Published under the auspices of the Deutsche Vereinigung für Mathematische Logik und für Grundlagenforschung der Exakten Wissenschaften (DVMLG) DVMLG
منابع مشابه
dominating subset and representation graph on topological spaces
Let a topological space. An intersection graph on a topological space , which denoted by , is an undirected graph which whose vertices are open subsets of and two vertices are adjacent if the intersection of them are nonempty. In this paper, the relation between topological properties of and graph properties of are investigated. Also some classifications and representations for the graph ...
متن کاملUniversal Succinct Representations of Trees?
We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T , our representations support the following operations in O(1) time: (i) BP-substring(i, b), which reports the substring of length b bits (b is at most the wordsize) beginning at position i of the balanced parenthesis representation of T , (ii) DFUDS-substring(i, b), which...
متن کاملEngineering the LOUDS Succinct Tree Representation
Ordinal trees are arbitrary rooted trees where the children of each node are ordered. We consider succinct, or highly space-efficient, representations of (static) ordinal trees with n nodes that use 2n+ o(n) bits of space to represent ordinal trees. There are a number of such representations: each supports a different set of tree operations in O(1) time on the RAM model. In this paper we focus ...
متن کاملSuccinct Indexes
This thesis defines and designs succinct indexes for several abstract data types (ADTs). The concept is to design auxiliary data structures that ideally occupy asymptotically less space than the information-theoretic lower bound on the space required to encode the given data, and support an extended set of operations using the basic operators defined in the ADT. As opposed to succinct (integrat...
متن کامل2 J an 2 00 8 Church , Cardinal and Ordinal Representations of Integers and Kolmogorov complexity
We consider classical representations of integers: Church’s function iterators, cardinal equivalence classes of sets, ordinal equivalence classes of totally ordered sets. Since programs do not work on abstract entities and require formal representations of objects, we effectivize these abstract notions in order to allow them to be computed by programs. To any such effectivized representation is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Log. Q.
دوره 59 شماره
صفحات -
تاریخ انتشار 2013